/*class Solution {
public:
    vector<int> findAnagrams(string s, string p) {
        int hash[128] = { 0 };

        vector<int> ret;
        for (int i = 0; i < s.size(); i++) {
            for (auto c : p) {
                hash[c]++;
            }
            bool flag = true;
            int left = i, right = i;
            while (hash[s[right]] != 0 && right < s.size()) {
                hash[s[right]]--;
                right++;
            }
            for (auto c : p) {
                if (hash[c] != 0) {
                    flag = false;
                    break;
                }
            }
            if (flag)
                ret.push_back(left);
            for (int n = 0; n < 128; n++) {
                hash[n] = 0;
            }
        }
        return ret;
    }
};*/